Trust Estimation and Aggregation in Peer-to-Peer Network Using Differential Gossip Algorithm

نویسندگان

  • Ruchir Gupta
  • Yatindra Nath Singh
چکیده

In peer-to-peer networks, free riding is a major problem. Reputation management systems can be used to overcome this problem. Reputation estimation methods generally do not considers the uncertainties in the inputs. We propose a reputation estimation method using BLUE (Best Linear Unbiased estimator) estimator that consider uncertainties in the input variables. Reputation aggregation in peer to peer networks is generally a very time and resource consuming process. Moreover, these methods consider that reputation of a node is same for every other node in the network, while this is not true. This paper also proposes a reputation aggregation algorithm that uses a variant of gossip algorithm called differential gossip. Differential gossip is fast and requires less amount of resources. This mechanism allows computation of different reputation value of a node for every other node in the network. We have implemented Differential Gossip Trust for power law network formed using PA Model. The reputation computed using differential gossip trust shows good immunity to collusion. We have verified the performance of the algorithm on power law networks of different sizes ranging from 100 nodes to 50,000 nodes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GGRA: a grouped gossip-based reputation aggregation algorithm

An important issue in P2P networks is the existence of malicious nodes that decreases the performance of such networks. Reputation system in which nodes are ranked based on their behavior, is one of the proposed solutions to detect and isolate malicious (low ranked) nodes. Gossip Trust is an interesting previously proposed algorithm for reputation aggregation in P2P networks based on t...

متن کامل

DisTriB: Distributed Trust Management Model Based on Gossip Learning and Bayesian Networks in Collaborative Computing Systems

The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...

متن کامل

DisTriB: Distributed Trust Management Model Based on Gossip Learning and Bayesian Networks in Collaborative Computing Systems

The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...

متن کامل

Asynchronous Distributed Power Iteration with Gossip-Based Normalization

The dominant eigenvector of matrices defined by weighted links in overlay networks plays an important role in many peer-to-peer applications. Examples include trust management, importance ranking to support search, and virtual coordinate systems to facilitate managing network proximity. Robust and efficient asynchronous distributed algorithms are known only for the case when the dominant eigenv...

متن کامل

A Practical Approach to Network Size Estimation for Structured Overlays

Structured overlay networks have recently received much attention due to their self-* properties under dynamic and decentralized settings. The number of nodes in an overlay fluctuates all the time due to churn. Since knowledge of the size of the overlay is a core requirement for many systems, estimating the size in a decentralized manner is a challenge taken up by recent research activities. Go...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1210.4301  شماره 

صفحات  -

تاریخ انتشار 2012